-
1 bit mask
"A numeric value intended for a bit-by-bit value comparison with other numeric values, typically to flag options in parameter or return values. Usually this comparison is done with bitwise logical operators, such as And and Or in Visual Basic, && and || in C++." -
2 bit
"A data type that stores either a 1 or 0 value. Integer values other than 1 or 0 are accepted, but they are always interpreted as 1."بت -
3 Type-Length-Value
"A method of organizing data that involves a Type code (16 bit), a specified length of a Value field (16 bit), and the data in the Value field (variable)." -
4 Type, Length, Value
"A method of organizing data that involves a Type code (16 bit), a specified length of a Value field (16 bit), and the data in the Value field (variable).""Type, Length, Value" -
5 broadcast bit
A one-bit field value in the flags field of the DHCP packet sent by the client to provide a hint to the DHCP server and to the relay agents to broadcast any messages sent to the client. -
6 bitmask
"A numeric value intended for a bit-by-bit value comparison with other numeric values, typically to flag options in parameter or return values. Usually this comparison is done with bitwise logical operators, such as And and Or in Visual Basic, && and || in C++." -
7 locale ID
A 32-bit value which consists of the language ID in the low word (bits 0-15) and the sorting ID (bits 16-19) and a reserved value (bits 20-31) in the high word. -
8 LCID
A 32-bit value which consists of the language ID in the low word (bits 0-15) and the sorting ID (bits 16-19) and a reserved value (bits 20-31) in the high word. -
9 locale identifier
A 32-bit value which consists of the language ID in the low word (bits 0-15) and the sorting ID (bits 16-19) and a reserved value (bits 20-31) in the high word.مُعرف اللغة المحلية -
10 SVF
"A function that returns a single value, such as a string, integer, or bit value." -
11 language code identifier
A 32-bit value which consists of the language ID in the low word (bits 0-15) and the sorting ID (bits 16-19) and a reserved value (bits 20-31) in the high word. -
12 access mask
"In Windows-based computers, a 32-bit value (a bitmask) that specifies the permissions that are assigned in an access control entry (ACE). An access mask is also part of the access request when an object is opened. The access mask in the request is compared to the access mask in each ACE to determine whether or not to grant the request." -
13 subnet mask
"A 32-bit value that enables the recipient of Internet Protocol version 4 (IPv4) packets to distinguish the network ID and host ID portions of the IPv4 address. Typically, subnet masks use the format 255.x.x.x. IPv6 uses network prefix notations rather than subnet masks." -
14 Language ID
A standard international numeric abbreviation for a country or geographical region. A language identifier is a 16-bit value that consists of a primary language identifier and a secondary language identifier.معرّف اللغة -
15 LANGID
A standard international numeric abbreviation for a country or geographical region. A language identifier is a 16-bit value that consists of a primary language identifier and a secondary language identifier. -
16 TLV
"A method of organizing data that involves a Type code (16 bit), a specified length of a Value field (16 bit), and the data in the Value field (variable)." -
17 hash algorithm
"An algorithm that produces a hash value of some piece of data, such as a message or session key. With a good hash algorithm, changes in the input data can change every bit in the resulting hash value; for this reason, hashes are useful in detecting any modification in a data object, such as a message. Furthermore, a good hash algorithm makes it computationally infeasible to construct two independent inputs that have the same hash. Typical hash algorithms include MD2, MD4, MD5, and SHA-1." -
18 hash function
"An algorithm that produces a hash value of some piece of data, such as a message or session key. With a good hash algorithm, changes in the input data can change every bit in the resulting hash value; for this reason, hashes are useful in detecting any modification in a data object, such as a message. Furthermore, a good hash algorithm makes it computationally infeasible to construct two independent inputs that have the same hash. Typical hash algorithms include MD2, MD4, MD5, and SHA-1." -
19 Secure Hash Algorithm 1
"An algorithm that generates a 160-bit hash value from an arbitrary amount of input data. SHA-1 is used with the Digital Signature Algorithm (DSA) in the Digital Signature Standard (DSS), among other places." -
20 SHA-1
"An algorithm that generates a 160-bit hash value from an arbitrary amount of input data. SHA-1 is used with the Digital Signature Algorithm (DSA) in the Digital Signature Standard (DSS), among other places."
- 1
- 2
См. также в других словарях:
Value (computer science) — In computer science, a value is a sequence of bits that is interpreted according to some data type. It is possible for the same sequence of bits to have different values, depending on the type used to interpret its meaning. For instance, the… … Wikipedia
Bit manipulation — is the act of algorithmically manipulating bits or other pieces of data shorter than a byte. Programming tasks that require bit manipulation include low level device control, error detection and correction algorithms, encryption algorithms, and… … Wikipedia
Bit blit — ( bitblt , blitting etc.) is a computer graphics operation in which several bitmap patterns are combined into one using a raster operator .OriginsThe name derives from the BitBLT machine instruction for the Xerox Alto computer, standing for Bit… … Wikipedia
Bit stream access — refers to the situation where a wireline incumbent install a high speed access link to the customers premises (e.g., by installing ADSL equipment in the local access network) and then makes this access link available to third parties, to enable… … Wikipedia
Bit — This article is about the unit of information. For other uses, see Bit (disambiguation). Fundamental units of information bit (binary) nat (base e) ban (decimal) qubit (quantum) This box … Wikipedia
Bit array — A bit array (or bitmap, in some cases) is an array data structure which compactly stores individual bits (boolean values). It implements a simple set data structure storing a subset of {1,2,..., n } and is effective at exploiting bit level… … Wikipedia
Bit plane — A bit plane of a digital discrete signal (such as image or sound) is a set of bits having the same position in the respective binary numbers [cite web last = first = authorlink = coauthors = title =Bit Plane work = publisher =PC Magazine date =… … Wikipedia
Bit stuffing — In data transmission and telecommunication, bit stuffing (also known uncommonly as positive justification) is the insertion of noninformation bits into data. Stuffed bits should not be confused with overhead bits. Bit stuffing is used for various … Wikipedia
bit — bit1 function word *** A bit can be used in the following ways: as an adverb: We waited a bit, and then decided to go. (before an adjective or adverb): It s a bit cold in here, isn t it? as a pronoun: She d only eaten a bit before she started… … Usage of the words and phrases in modern English
Bit numbering — In computing, bit positions in a binary numberor a container for such a value are assigned a bit number.The bit number starts with zero and is incremented by one for each subsequent bit position.When the bit numbering starts at zero for the least … Wikipedia
bit — I. noun Etymology: Middle English bitt, from Old English bite act of biting; akin to Old English bītan bite Date: 14th century 1. a. (1) the biting or cutting edge or part of a tool (2) a replaceable part of a compound tool that actually performs … New Collegiate Dictionary
